5 research outputs found

    (On the isomorphism problem of bi-Cayley graphs)

    Get PDF

    Classification of nilpotent 3-BCI-groups

    Get PDF
    ‎‎Given a finite group GG and a subset SsubseteqG,Ssubseteq G, the bi-Cayley graph bcay(G,S)bcay(G,S) is the graph whose vertex‎ ‎set is Gtimes0,1G times {0,1} and edge set is‎ ‎(x,0),(sx,1)‎:‎xinG‎,‎sinS{ {(x,0),(s x,1)}‎ : ‎x in G‎, ‎sin S }‎. ‎A bi-Cayley graph bcay(G,S)bcay(G,S) is called a BCI-graph if for any bi-Cayley graph‎ ‎bcay(G,T),bcay(G,T), bcay(G,S)congbcay(G,T)bcay(G,S) cong bcay(G,T) implies that T=gSalphaT = g S^alpha for some ginGg in G and alphainaut(G)alpha in aut(G)‎. ‎A group GG is called an mm-BCI-group if all bi-Cayley graphs of GG of valency at most mm are BCI-graphs‎. ‎It was proved by Jin and Liu that‎, ‎if GG is a 33-BCI-group‎, ‎then its Sylow 22-subgroup is cyclic‎, ‎or elementary abelian‎, ‎or QQ [European J‎. ‎Combin‎. ‎31 (2010)‎ ‎1257--1264]‎, ‎and that a Sylow pp-subgroup‎, ‎pp is an odd prime‎, ‎is homocyclic [Util‎. ‎Math‎. ‎86 (2011) 313--320]‎. ‎In this paper we show that the converse also holds in the‎ ‎case when GG is nilpotent‎, ‎and hence complete the classification of‎ ‎nilpotent 33-BCI-groups‎
    corecore